//The MIT License
//
//Copyright (c) 2009 nodchip
//
//Permission is hereby granted, free of charge, to any person obtaining a copy
//of this software and associated documentation files (the "Software"), to deal
//in the Software without restriction, including without limitation the rights
//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
//copies of the Software, and to permit persons to whom the Software is
//furnished to do so, subject to the following conditions:
//
//The above copyright notice and this permission notice shall be included in
//all copies or substantial portions of the Software.
//
//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
//THE SOFTWARE.
package tv.dyndns.kishibe.client.util;

public class IntArrays {
	private IntArrays() {
	}

	public static int minValue(int[] values) {
		int result = Integer.MAX_VALUE;
		for (int i = 0; i < values.length; ++i) {
			result = Math.min(result, values[i]);
		}
		return result;
	}

	public static int maxValue(int[] values) {
		int result = Integer.MIN_VALUE;
		for (int i = 0; i < values.length; ++i) {
			result = Math.max(result, values[i]);
		}
		return result;
	}

	public static int average(int[] values) {
		int result = 0;
		for (int i = 0; i < values.length; ++i) {
			result += values[i];
		}
		return result / values.length;
	}

	public static void reverse(int[] values) {
		for (int i = 0, j = values.length - 1; i < j; ++i, --j) {
			int temp = values[i];
			values[i] = values[j];
			values[j] = temp;
		}
	}
}
